Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures
نویسندگان
چکیده
We present techniques for maintaining subgraph frequencies in a dynamic graph, using data structures that are parameterized in terms of h, the h-index of the graph. Our methods extend previous results of Eppstein and Spiro for maintaining statistics for undirected subgraphs of size three to directed subgraphs and to subgraphs of size four. For the directed case, we provide a data structure to maintain counts for all 3-vertex induced subgraphs in O(h) amortized time per update. For the undirected case, we maintain the counts of size-four subgraphs in O(h) amortized time per update. These extensions enable a number of new applications in Bioinformatics and Social Networking research.
منابع مشابه
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
We describe a data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices. More generally it can be used to maintain the number of copies of each possible three-vertex subgraph in time O(h) per update, where h is the h-index of the graph, the maximum number such that the graph contains h vertices o...
متن کاملUnderstanding the Complexity of Induced Subgraph Isomorphisms
We study left-hand side restrictions of the induced subgraph isomorphism problem: Fixing a class C, for given graphs G ∈ C and arbitrary H we ask for induced subgraphs of H isomorphic to G. For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau, Kolaitis and Vardi for the decision problem and by Dalmau and Jonsson for its counting variant. We give a dichotomy...
متن کاملParallelizing Subgraph Isomorphism Reenement for Classiication and Retrieval of Conceptual Structures 3 a Relation-based Representation For
abstract Major applications of graph-based knowledge representations will require quick response times on extremely large knowledge bases. Although algorithmic developments have provided tremendous improvements in speed, we believe implementation on parallel processors will be needed to meet long-term needs. This paper presents a new parallelization of a subgraph isomorphism reenement algorithm...
متن کاملThe k-Sparsest Subgraph Problem
Given a simple undirected graph G = (V,E) and an integer k ≤ |V |, the ksparsest subgraph problem asks for a set of k vertices that induce the minimum number of edges. As a generalization of the classical independent set problem, k-sparsest subgraph cannot admit (unless P = NP) neither an approximation nor an FPT algorithm (parameterized by the number of edges in the solution) in all graph clas...
متن کاملParameterized complexity of finding small degree-constrained subgraphs
In this article we study the parameterized complexity of problems consisting in finding degree-constrained subgraphs, taking as the parameter the number of vertices of the desired subgraph. Namely, given two positive integers d and k, we study the problem of finding a d-regular (induced or not) subgraph with at most k vertices and the problem of finding a subgraph with at most k vertices and of...
متن کامل